const github.com/andybalholm/brotli.codeLengthCodes

22 uses

	github.com/andybalholm/brotli (current package)
		bit_cost.go#L107: 		var depth_histo = [codeLengthCodes]uint32{0}
		bit_cost.go#L170: 		bits += bitsEntropy(depth_histo[:], codeLengthCodes)
		bit_cost.go#L238: 		var depth_histo = [codeLengthCodes]uint32{0}
		bit_cost.go#L301: 		bits += bitsEntropy(depth_histo[:], codeLengthCodes)
		bit_cost.go#L369: 		var depth_histo = [codeLengthCodes]uint32{0}
		bit_cost.go#L432: 		bits += bitsEntropy(depth_histo[:], codeLengthCodes)
		brotli_bit_stream.go#L227: var storeHuffmanTreeOfHuffmanTreeToBitMask_kStorageOrder = [codeLengthCodes]byte{1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15}
		brotli_bit_stream.go#L234: 	var codes_to_store uint = codeLengthCodes
		brotli_bit_stream.go#L342: 	var code_length_bitdepth = [codeLengthCodes]byte{0}
		brotli_bit_stream.go#L343: 	var code_length_bitdepth_symbols [codeLengthCodes]uint16
		brotli_bit_stream.go#L344: 	var huffman_tree_histogram = [codeLengthCodes]uint32{0}
		brotli_bit_stream.go#L362: 	for i = 0; i < codeLengthCodes; i++ {
		brotli_bit_stream.go#L376: 	createHuffmanTree(huffman_tree_histogram[:], codeLengthCodes, 5, tree, code_length_bitdepth[:])
		brotli_bit_stream.go#L378: 	convertBitDepthsToSymbols(code_length_bitdepth[:], codeLengthCodes, code_length_bitdepth_symbols[:])
		constants.go#L31: const codeLengthCodes = (repeatZeroCodeLength + 1)
		decode.go#L62: var kCodeLengthCodeOrder = [codeLengthCodes]byte{1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15}
		decode.go#L661: 	for ; i < codeLengthCodes; i++ {
		decode.go#L739: 				for i = 0; i < codeLengthCodes; i++ {
		huffman.go#L409: 	var sorted [codeLengthCodes]int
		huffman.go#L428: 	offset[0] = codeLengthCodes - 1
		huffman.go#L431: 	symbol = codeLengthCodes
		state.go#L149: 	code_length_code_lengths    [codeLengthCodes]byte